Efficient polygon enclosure algorithms for device extraction from VLSI layouts
نویسندگان
چکیده
The typical description of a VLSI layout is the geometrical description of masks. Layout verification [4] is the testing of a layout to see if it satisfies design and layout rules. An important problem in layout verification is layout device extraction, which involves detection of capacitors, resistors, transistors etc. from the geometrical description of masks. The layout extraction process starts with a circuit layout and based on user-defined relationship information and it proceeds to detect electrical components from the geometrical relationships of the layout. In this paper we consider the extraction of BJT (bipolar junction transistor) devices.
منابع مشابه
Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques e...
متن کاملFast continuous Fourier and Haar transforms of rectilinear polygons from very-large-scale integration layouts
We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts traditionally used. Not only are continuous transforms closer to the underlying continuous physical reality, but they also avoid the inherent...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming
We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...
متن کاملAn Efficient Technique for Substrate Coupling Parasitic Extraction with Application to RF/Microwave Spiral Inductors (RESEARCH NOTE)
This paper presents an efficient modeling method, based on the microstrip lines theory, for the coupling between a substrate backplane and a device contact. We derive simple closed-form formulas for rapid extraction of substrate parasitics. We use these formulas to model spiral inductors as important substrate-noise sources in mixed-signal systems. The proposed model is verified for the freque...
متن کاملPruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts
We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There, speed is of paramount importance due to the magnitude of the problems to be solved and hence very fast algorithms are needed. We show that by tech...
متن کامل